Coverings with connected intersections

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS

Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...

متن کامل

algebras with cycle-finite strongly simply connected galois coverings

let $a$ be a nite dimensional $k-$algebra and $r$ be a locally bounded category such that $r rightarrow r/g = a$ is a galois covering de ned by the action of a torsion-free group of automorphisms of $r$. following [30], we provide criteria on the convex subcategories of a strongly simply connected category r in order to be a cycle- nite category and describe the module category of $a$. we pro...

متن کامل

Connected coverings and an application to oriented matroids

In this paper we are interested in the following question: what is the smallest number of circuits, s(n,r), that is sufficient to determine every uniform oriented matroid of rank r on n elements? We shall give different upper bounds for s(n,r) by using special coverings called connected coverings. (~) 1998 Elsevier Science B.V. All rights reserved

متن کامل

Intersections of Longest Cycles in k-Connected Graphs

Let G be a connected graph, where k2. S. Smith conjectured that every two longest cycles of G have at least k vertices in common. In this note, we show that every two longest cycles meet in at least ck 3Â5 vertices, where cr0.2615. 1998 Academic Press In this note, we provide a lower bound on the number of vertices in the intersection of any two longest cycles in a k-connected graph (k2). This ...

متن کامل

Low Degree Complete Intersections Are Rationally Simply Connected

We prove smooth, low degree complete intersections in projective space are rationally simply connected in a strong sense. Using a result of Hassett, we deduce weak approximation for smooth, low degree complete intersections defined over the function field of a curve.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1950

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1950-0043453-6